On Solving of Constrained Convex Minimize Problem Using Gradient Projection Method
نویسندگان
چکیده
منابع مشابه
The Gradient Projection Method for Solving an Optimal Control Problem
A gradient method for solving an optimal control problem described by a parabolic equation is considered. The gradient projection method is applied to solve the problem. The convergence of the projection algorithm is investigated.
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
A New Modified Gradient-Projection Algorithm for Solution of Constrained Convex Minimization Problem in Hilbert Spaces
Manuscript received January 01, 2014; revised March 28, 2014. This work was supported in part by King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia. Cyril Dennis Enyi is with King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia. (corresponding author: +966550782390; e-mail: cenyi@ kfupm.edu.sa). Mukiawa Edwin Soh is with King Fahd University of Petroleum and ...
متن کاملRegularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
Let H be a real Hilbert space and C be a nonempty closed convex subset of H. Assume that g is a real-valued convex function and the gradient ∇g is [Formula: see text]-ism with [Formula: see text]. Let [Formula: see text], [Formula: see text]. We prove that the sequence [Formula: see text] generated by the iterative algorithm [Formula: see text], [Formula: see text] converges strongly to [Formul...
متن کاملGradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
We consider the problem of minimizing a smooth convex objective function subject to the set of minima of another differentiable convex function. In order to solve this problem, we propose an algorithm which combines the gradient method with a penalization technique. Moreover, we insert in our algorithm an inertial term, which is able to take advantage of the history of the iterates. We show wea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2018
ISSN: 0161-1712,1687-0425
DOI: 10.1155/2018/1580837